On approximability of linear ordering and related NP-optimization problems on graphs
نویسندگان
چکیده
منابع مشابه
On Approximability of Linear Ordering and Related NP-optimization Problems on Graphs (Extended Abstract)
We investigate the approximability of minimum and maximum linear ordering problems (MIN-LOP and MAX-LOP) and related feedback set problems such as maximum weight acyclic subdiagraph (MAX-W-SUBDAG), minimum weight feedback arc/vertex set (MIN-W-FAS/ MIN-W-FVS) and a generalization of the latter called MIN-Subset-FAS/MIN-Subset-FVS. MAX-LOP and the other problems have been studied by many researc...
متن کاملon the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولOn the Hardness of Approximating Some NP-optimization Problems Related to Minimum Linear Ordering Problem
We study hardness of approximating several minimaximal and maximinimal NP-optimization problems related to the minimum linear ordering problem (MINLOP). MINLOP is to find a minimum weight acyclic tournament in a given arc-weighted complete digraph. MINLOP is APX-hard but its unweighted version is polynomial time solvable. We prove that, MIN-MAX-SUBDAG problem, which is a generalization of MINLO...
متن کاملLinear Problem Kernels for NP-Hard Problems on Planar Graphs
We develop a generic framework for deriving linear-size problem kernels for NP-hard problems on planar graphs. We demonstrate the usefulness of our framework in several concrete case studies, giving new kernelization results for Connected Vertex Cover, Minimum Edge Dominating Set,Maximum Triangle Packing, and Efficient Dominating Set on planar graphs. On the route to these results, we present e...
متن کاملOn the approximability of some NP-hard minimization problems for linear systems
We investigate the computational complexity of two classes of combinatorial optimization problems related to linear systems and study the relationship between their approximability properties. In the rst class (Min ULR) one wishes, given a possibly infeasible system of linear relations, to nd a solution that violates as few relations as possible while satisfying all the others. In the second cl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2004
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(03)00444-x